Realizability of Metric-Dependent Dimensions
نویسندگان
چکیده
منابع مشابه
Realizability models for a linear dependent PCF
Recently, Dal Lago and Gaboardi have proposed a type system, named d`PCF as a framework for implicit computational complexity. d`PCF is a non-standard type system for PCF programs which is relatively complete with respect to complexity properties thanks to the use of linear types inspired by Bounded linear logic and dependent types à la Dependent ML. In this work, we adapt the framework of quan...
متن کاملFrom Realizability to Induction via Dependent Intersection
In this paper, it is shown that induction is derivable in a type-assignment formulation of the second-order dependent type theory λP2, extended with the implicit product type of Miquel, dependent intersection type of Kopylov, and heterogeneous equality type of McBride. The crucial idea is to use dependent intersections to internalize a result of Leivant’s showing that Church-encoded data may be...
متن کاملComparison of Spirituality Dimensions among Opioid-Dependent, Methamphetamine Dependent, and Normal People
Background and Objectives: Substance abuse and dependence is one of the major problems and concerns of today's world. Spiritual vacuums are a cause of tendency toward drugs abuse. The aim of this study is to compare spirituality components among opioid-dependent, methamphetamine dependent, and normal people in Shiraz. Methods: The study population of this causal-comparative study consisted of 5...
متن کاملNearest-Neighbor Searching and Metric Space Dimensions
Given a set S of points in a metric space with distance function D, the nearest-neighbor searching problem is to build a data structure for S so that for an input query point q, the point s ∈ S that minimizes D(s, q) can be found quickly. We survey approaches to this problem, and its relation to concepts of metric space dimension. Several measures of dimension can be estimated using nearest-nei...
متن کاملComputational Higher Type Theory II: Dependent Cubical Realizability
This is the second in a series of papers extending Martin-Löf’smeaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I, and extend it to a meaning explanation of dependent higher-dimensional type theory. This extension requires generalizing the computational Kan condition given in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.2307/2036229